0.03/0.12	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.03/0.12	% Command    : run_E %s %d THM
0.12/0.33	% Computer : n019.cluster.edu
0.12/0.33	% Model    : x86_64 x86_64
0.12/0.33	% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.12/0.33	% Memory   : 8042.1875MB
0.12/0.33	% OS       : Linux 3.10.0-693.el7.x86_64
0.12/0.33	% CPULimit   : 1440
0.12/0.33	% WCLimit    : 180
0.12/0.33	% DateTime   : Thu Jul  4 08:03:08 EDT 2024
0.12/0.33	% CPUTime    : 
0.20/0.47	Running higher-order theorem proving
0.20/0.50	Running: /export/starexec/sandbox/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=180 /export/starexec/sandbox/tmp/tmp.FaV0oQcg1W/E---3.1_7719.p
1.30/0.66	# Version: 3.2.0-ho
1.30/0.66	# Preprocessing class: HSLSSMSSSSSNHSA.
1.30/0.66	# Scheduled 4 strats onto 8 cores with 180 seconds (1440 total)
1.30/0.66	# Starting full_lambda_9 with 900s (5) cores
1.30/0.66	# Starting new_ho_11 with 180s (1) cores
1.30/0.66	# Starting sh2l with 180s (1) cores
1.30/0.66	# Starting new_bool_6 with 180s (1) cores
1.30/0.66	# sh2l with pid 7799 completed with status 0
1.30/0.66	# Result found by sh2l
1.30/0.66	# Preprocessing class: HSLSSMSSSSSNHSA.
1.30/0.66	# Scheduled 4 strats onto 8 cores with 180 seconds (1440 total)
1.30/0.66	# Starting full_lambda_9 with 900s (5) cores
1.30/0.66	# Starting new_ho_11 with 180s (1) cores
1.30/0.66	# Starting sh2l with 180s (1) cores
1.30/0.66	# SinE strategy is gf120_gu_RUU_F100_L01000
1.30/0.66	# Search class: HGHSM-FSLF32-MHSFFSBC
1.30/0.66	# Scheduled 6 strats onto 1 cores with 180 seconds (180 total)
1.30/0.66	# Starting new_ho_10 with 98s (1) cores
1.30/0.66	# new_ho_10 with pid 7807 completed with status 0
1.30/0.66	# Result found by new_ho_10
1.30/0.66	# Preprocessing class: HSLSSMSSSSSNHSA.
1.30/0.66	# Scheduled 4 strats onto 8 cores with 180 seconds (1440 total)
1.30/0.66	# Starting full_lambda_9 with 900s (5) cores
1.30/0.66	# Starting new_ho_11 with 180s (1) cores
1.30/0.66	# Starting sh2l with 180s (1) cores
1.30/0.66	# SinE strategy is gf120_gu_RUU_F100_L01000
1.30/0.66	# Search class: HGHSM-FSLF32-MHSFFSBC
1.30/0.66	# Scheduled 6 strats onto 1 cores with 180 seconds (180 total)
1.30/0.66	# Starting new_ho_10 with 98s (1) cores
1.30/0.66	# Preprocessing time       : 0.011 s
1.30/0.66	# Presaturation interreduction done
1.30/0.66	
1.30/0.66	# Proof found!
1.30/0.66	# SZS status Theorem
1.30/0.66	# SZS output start CNFRefutation
1.30/0.66	thf(decl_sort1, type, nat: $tType).
1.30/0.66	thf(decl_sort2, type, a: $tType).
1.30/0.66	thf(decl_sort3, type, list_a: $tType).
1.30/0.66	thf(decl_22, type, minus_minus_nat: nat > nat > nat).
1.30/0.66	thf(decl_31, type, listIn1312259492pend_a: list_a > (nat > a) > nat > a).
1.30/0.66	thf(decl_33, type, listIn1417627087drop_a: nat > (nat > a) > nat > a).
1.30/0.66	thf(decl_39, type, drop_a: nat > list_a > list_a).
1.30/0.66	thf(decl_45, type, size_size_list_a: list_a > nat).
1.30/0.66	thf(decl_46, type, ord_less_nat: nat > nat > $o).
1.30/0.66	thf(decl_47, type, ord_less_eq_nat: nat > nat > $o).
1.30/0.66	thf(decl_48, type, f: nat > a).
1.30/0.66	thf(decl_49, type, n: nat).
1.30/0.66	thf(decl_50, type, xs: list_a).
1.30/0.66	thf(conj_0, conjecture, ((~((ord_less_nat @ n @ (size_size_list_a @ xs)))=>((listIn1417627087drop_a @ n @ (listIn1312259492pend_a @ xs @ f))=(listIn1417627087drop_a @ (minus_minus_nat @ n @ (size_size_list_a @ xs)) @ f)))&(((listIn1417627087drop_a @ n @ (listIn1312259492pend_a @ xs @ f))=(listIn1312259492pend_a @ (drop_a @ n @ xs) @ f))<=(ord_less_nat @ n @ (size_size_list_a @ xs)))), file('/export/starexec/sandbox/tmp/tmp.FaV0oQcg1W/E---3.1_7719.p', conj_0)).
1.30/0.66	thf(fact_209_verit__comp__simplify1_I3_J, axiom, ![X40:nat, X41:nat]:((~((ord_less_eq_nat @ X40 @ X41))<=>(ord_less_nat @ X41 @ X40))), file('/export/starexec/sandbox/tmp/tmp.FaV0oQcg1W/E---3.1_7719.p', fact_209_verit__comp__simplify1_I3_J)).
1.30/0.66	thf(fact_35_i__append__i__drop__eq2, axiom, ![X20:list_a, X8:nat, X74:nat > a]:(((ord_less_eq_nat @ (size_size_list_a @ X20) @ X8)=>((listIn1417627087drop_a @ X8 @ (listIn1312259492pend_a @ X20 @ X74))=(listIn1417627087drop_a @ (minus_minus_nat @ X8 @ (size_size_list_a @ X20)) @ X74)))), file('/export/starexec/sandbox/tmp/tmp.FaV0oQcg1W/E---3.1_7719.p', fact_35_i__append__i__drop__eq2)).
1.30/0.66	thf(fact_203_less__le, axiom, ((ord_less_nat)=(^[X45:nat, X46:nat]:((((X45)!=(X46))&(ord_less_eq_nat @ X45 @ X46))))), file('/export/starexec/sandbox/tmp/tmp.FaV0oQcg1W/E---3.1_7719.p', fact_203_less__le)).
1.30/0.66	thf(fact_33_i__append__i__drop__eq1, axiom, ![X8:nat, X20:list_a, X123:nat > a]:(((ord_less_eq_nat @ X8 @ (size_size_list_a @ X20))=>((listIn1417627087drop_a @ X8 @ (listIn1312259492pend_a @ X20 @ X123))=(listIn1312259492pend_a @ (drop_a @ X8 @ X20) @ X123)))), file('/export/starexec/sandbox/tmp/tmp.FaV0oQcg1W/E---3.1_7719.p', fact_33_i__append__i__drop__eq1)).
1.30/0.66	thf(c_0_5, negated_conjecture, ~(((~(ord_less_nat @ n @ (size_size_list_a @ xs))=>((listIn1417627087drop_a @ n @ (listIn1312259492pend_a @ xs @ f))=(listIn1417627087drop_a @ (minus_minus_nat @ n @ (size_size_list_a @ xs)) @ f)))&((ord_less_nat @ n @ (size_size_list_a @ xs))=>((listIn1417627087drop_a @ n @ (listIn1312259492pend_a @ xs @ f))=(listIn1312259492pend_a @ (drop_a @ n @ xs) @ f))))), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conj_0])])).
1.30/0.66	thf(c_0_6, plain, ![X40:nat, X41:nat]:((~(ord_less_eq_nat @ X40 @ X41)<=>(ord_less_nat @ X41 @ X40))), inference(fof_simplification,[status(thm)],[fact_209_verit__comp__simplify1_I3_J])).
1.30/0.66	thf(c_0_7, negated_conjecture, ((((ord_less_nat @ n @ (size_size_list_a @ xs))|~(ord_less_nat @ n @ (size_size_list_a @ xs)))&(((listIn1417627087drop_a @ n @ (listIn1312259492pend_a @ xs @ f))!=(listIn1312259492pend_a @ (drop_a @ n @ xs) @ f))|~(ord_less_nat @ n @ (size_size_list_a @ xs))))&(((ord_less_nat @ n @ (size_size_list_a @ xs))|((listIn1417627087drop_a @ n @ (listIn1312259492pend_a @ xs @ f))!=(listIn1417627087drop_a @ (minus_minus_nat @ n @ (size_size_list_a @ xs)) @ f)))&(((listIn1417627087drop_a @ n @ (listIn1312259492pend_a @ xs @ f))!=(listIn1312259492pend_a @ (drop_a @ n @ xs) @ f))|((listIn1417627087drop_a @ n @ (listIn1312259492pend_a @ xs @ f))!=(listIn1417627087drop_a @ (minus_minus_nat @ n @ (size_size_list_a @ xs)) @ f))))), inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])])).
1.30/0.66	thf(c_0_8, plain, ![X1048:list_a, X1049:nat, X1050:nat > a]:((~(ord_less_eq_nat @ (size_size_list_a @ X1048) @ X1049)|((listIn1417627087drop_a @ X1049 @ (listIn1312259492pend_a @ X1048 @ X1050))=(listIn1417627087drop_a @ (minus_minus_nat @ X1049 @ (size_size_list_a @ X1048)) @ X1050)))), inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_35_i__append__i__drop__eq2])])])).
1.30/0.66	thf(c_0_9, plain, ![X1168:nat, X1169:nat]:((((ord_less_eq_nat @ X1168 @ X1169)|(ord_less_nat @ X1169 @ X1168))&(~(ord_less_nat @ X1169 @ X1168)|~(ord_less_eq_nat @ X1168 @ X1169)))), inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])])).
1.30/0.66	thf(c_0_10, plain, ![X768:nat, X769:nat]:(((ord_less_nat @ X768 @ X769)<=>(((X768)!=(X769))&(ord_less_eq_nat @ X768 @ X769)))), inference(fof_simplification,[status(thm)],[inference(fof_simplification,[status(thm)],[inference(fof_simplification,[status(thm)],[fact_203_less__le])])])).
1.30/0.66	thf(c_0_11, negated_conjecture, ((ord_less_nat @ n @ (size_size_list_a @ xs))|((listIn1417627087drop_a @ n @ (listIn1312259492pend_a @ xs @ f))!=(listIn1417627087drop_a @ (minus_minus_nat @ n @ (size_size_list_a @ xs)) @ f))), inference(split_conjunct,[status(thm)],[c_0_7])).
1.30/0.66	thf(c_0_12, plain, ![X11:list_a, X9:nat > a, X1:nat]:((((listIn1417627087drop_a @ X1 @ (listIn1312259492pend_a @ X11 @ X9))=(listIn1417627087drop_a @ (minus_minus_nat @ X1 @ (size_size_list_a @ X11)) @ X9))|~((ord_less_eq_nat @ (size_size_list_a @ X11) @ X1)))), inference(split_conjunct,[status(thm)],[c_0_8])).
1.30/0.66	thf(c_0_13, plain, ![X2:nat, X1:nat]:(((ord_less_eq_nat @ X1 @ X2)|(ord_less_nat @ X2 @ X1))), inference(split_conjunct,[status(thm)],[c_0_9])).
1.30/0.66	thf(c_0_14, plain, ![X1172:nat, X1173:nat]:((((((X1172)!=(X1173))|~(ord_less_nat @ X1172 @ X1173))&((ord_less_eq_nat @ X1172 @ X1173)|~(ord_less_nat @ X1172 @ X1173)))&(((X1172)=(X1173))|~(ord_less_eq_nat @ X1172 @ X1173)|(ord_less_nat @ X1172 @ X1173)))), inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_10])])])])).
1.30/0.66	thf(c_0_15, negated_conjecture, (((listIn1417627087drop_a @ n @ (listIn1312259492pend_a @ xs @ f))!=(listIn1312259492pend_a @ (drop_a @ n @ xs) @ f))|~((ord_less_nat @ n @ (size_size_list_a @ xs)))), inference(split_conjunct,[status(thm)],[c_0_7])).
1.30/0.66	thf(c_0_16, negated_conjecture, (ord_less_nat @ n @ (size_size_list_a @ xs)), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_11, c_0_12]), c_0_13])).
1.30/0.66	thf(c_0_17, plain, ![X1051:nat, X1052:list_a, X1053:nat > a]:((~(ord_less_eq_nat @ X1051 @ (size_size_list_a @ X1052))|((listIn1417627087drop_a @ X1051 @ (listIn1312259492pend_a @ X1052 @ X1053))=(listIn1312259492pend_a @ (drop_a @ X1051 @ X1052) @ X1053)))), inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_33_i__append__i__drop__eq1])])])).
1.30/0.66	thf(c_0_18, plain, ![X1:nat, X2:nat]:(((ord_less_eq_nat @ X1 @ X2)|~((ord_less_nat @ X1 @ X2)))), inference(split_conjunct,[status(thm)],[c_0_14])).
1.30/0.66	thf(c_0_19, negated_conjecture, ((listIn1417627087drop_a @ n @ (listIn1312259492pend_a @ xs @ f))!=(listIn1312259492pend_a @ (drop_a @ n @ xs) @ f)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_15, c_0_16])])).
1.30/0.66	thf(c_0_20, plain, ![X1:nat, X9:nat > a, X11:list_a]:((((listIn1417627087drop_a @ X1 @ (listIn1312259492pend_a @ X11 @ X9))=(listIn1312259492pend_a @ (drop_a @ X1 @ X11) @ X9))|~((ord_less_eq_nat @ X1 @ (size_size_list_a @ X11))))), inference(split_conjunct,[status(thm)],[c_0_17])).
1.30/0.66	thf(c_0_21, negated_conjecture, (ord_less_eq_nat @ n @ (size_size_list_a @ xs)), inference(spm,[status(thm)],[c_0_18, c_0_16])).
1.30/0.66	thf(c_0_22, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19, c_0_20]), c_0_21])]), ['proof']).
1.30/0.66	# SZS output end CNFRefutation
1.30/0.66	# Parsed axioms                        : 286
1.30/0.66	# Removed by relevancy pruning/SinE    : 75
1.30/0.66	# Initial clauses                      : 548
1.30/0.66	# Removed in clause preprocessing      : 23
1.30/0.66	# Initial clauses in saturation        : 525
1.30/0.66	# Processed clauses                    : 744
1.30/0.66	# ...of these trivial                  : 8
1.30/0.66	# ...subsumed                          : 203
1.30/0.66	# ...remaining for further processing  : 532
1.30/0.66	# Other redundant clauses eliminated   : 75
1.30/0.66	# Clauses deleted for lack of memory   : 0
1.30/0.66	# Backward-subsumed                    : 2
1.30/0.66	# Backward-rewritten                   : 4
1.30/0.66	# Generated clauses                    : 1086
1.30/0.66	# ...of the previous two non-redundant : 911
1.30/0.66	# ...aggressively subsumed             : 0
1.30/0.66	# Contextual simplify-reflections      : 3
1.30/0.66	# Paramodulations                      : 976
1.30/0.66	# Factorizations                       : 4
1.30/0.66	# NegExts                              : 12
1.30/0.66	# Equation resolutions                 : 93
1.30/0.66	# Disequality decompositions           : 0
1.30/0.66	# Total rewrite steps                  : 251
1.30/0.66	# ...of those cached                   : 171
1.30/0.66	# Propositional unsat checks           : 0
1.30/0.66	#    Propositional check models        : 0
1.30/0.66	#    Propositional check unsatisfiable : 0
1.30/0.66	#    Propositional clauses             : 0
1.30/0.66	#    Propositional clauses after purity: 0
1.30/0.66	#    Propositional unsat core size     : 0
1.30/0.66	#    Propositional preprocessing time  : 0.000
1.30/0.66	#    Propositional encoding time       : 0.000
1.30/0.66	#    Propositional solver time         : 0.000
1.30/0.66	#    Success case prop preproc time    : 0.000
1.30/0.66	#    Success case prop encoding time   : 0.000
1.30/0.66	#    Success case prop solver time     : 0.000
1.30/0.66	# Current number of processed clauses  : 143
1.30/0.66	#    Positive orientable unit clauses  : 28
1.30/0.66	#    Positive unorientable unit clauses: 2
1.30/0.66	#    Negative unit clauses             : 24
1.30/0.66	#    Non-unit-clauses                  : 89
1.30/0.66	# Current number of unprocessed clauses: 1020
1.30/0.66	# ...number of literals in the above   : 3223
1.30/0.66	# Current number of archived formulas  : 0
1.30/0.66	# Current number of archived clauses   : 334
1.30/0.66	# Clause-clause subsumption calls (NU) : 28159
1.30/0.66	# Rec. Clause-clause subsumption calls : 6540
1.30/0.66	# Non-unit clause-clause subsumptions  : 173
1.30/0.66	# Unit Clause-clause subsumption calls : 514
1.30/0.66	# Rewrite failures with RHS unbound    : 0
1.30/0.66	# BW rewrite match attempts            : 40
1.30/0.66	# BW rewrite match successes           : 7
1.30/0.66	# Condensation attempts                : 744
1.30/0.66	# Condensation successes               : 18
1.30/0.66	# Termbank termtop insertions          : 85988
1.30/0.66	# Search garbage collected termcells   : 10554
1.30/0.66	
1.30/0.66	# -------------------------------------------------
1.30/0.66	# User time                : 0.124 s
1.30/0.66	# System time              : 0.007 s
1.30/0.66	# Total time               : 0.131 s
1.30/0.66	# Maximum resident set size: 4056 pages
1.30/0.66	
1.30/0.66	# -------------------------------------------------
1.30/0.66	# User time                : 0.132 s
1.30/0.66	# System time              : 0.011 s
1.30/0.66	# Total time               : 0.143 s
1.30/0.66	# Maximum resident set size: 2180 pages
1.30/0.66	% E---3.1 exiting
1.30/0.66	% E exiting
1.30/0.66	EOF